Metric learning for enzyme active-site search
نویسندگان
چکیده
منابع مشابه
Metric learning for enzyme active-site search
MOTIVATION Finding functionally analogous enzymes based on the local structures of active sites is an important problem. Conventional methods use templates of local structures to search for analogous sites, but their performance depends on the selection of atoms for inclusion in the templates. RESULTS The automatic selection of atoms so that site matches can be discriminated from mismatches. ...
متن کاملSupplemental Information: Metric Learning for Enzyme Active-Site Search
Vectors are denoted by boldfaced lower-case letters, and matrices by boldfaced upper-case letters. Elements of vectors and matrices are not bold-faced. The transposition of a matrix A is denoted by A and the inverse of A is denoted by A−1. The n × n identity matrix is denoted by In. We use Eij to denote a matrix in which (i, j) element is one and all the others are zero. The n-dimensional vecto...
متن کاملActive Metric Learning for Object Recognition
Popular visual representations like SIFT have shown broad applicability across many task. This great generality comes naturally with a lack of specificity when focusing on a particular task or a set of classes. Metric learning approaches have been proposed to tailor general purpose representations to the needs of more specific tasks and have shown strong improvements on visual matching and reco...
متن کاملActive Metric Learning for Supervised Classification
Clustering and classification critically rely on distance metrics that provide meaningful comparisons between data points. We present mixedinteger optimization approaches to find optimal distance metrics that generalize the Mahalanobis metric extensively studied in the literature. Additionally, we generalize and improve upon leading methods by removing reliance on pre-designated “target neighbo...
متن کاملBayesian Active Distance Metric Learning
Distance metric learning is an important component for many tasks, such as statistical classification and content-based image retrieval. Existing approaches for learning distance metrics from pairwise constraints typically suffer from two major problems. First, most algorithms only offer point estimation of the distance metric and can therefore be unreliable when the number of training examples...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2010
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btq519